Partial Order Trace Analyzer (POTA) for Distributed Programs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partial Order Trace Analyzer (POTA) for Distributed Programs

Checking the correctness of software is a growing challenge. In this paper, we present a prototype implementation of Partial Order Trace Analyzer (POTA), a tool for checking execution traces of both message passing and shared memory programs using temporal logic. So far runtime verification tools have used the total order model of an execution trace, whereas POTA uses a partial order model. The...

متن کامل

Distributed Slicing and Partial Re-execution for Distributed Programs

Sofia Abstract We present a parallel algorithm to compute dynamic slices for distributed programs. Dynamic slices are used in debugging to re-execute only those statements of the original program that actually influenced an observed erroneous result. We introduce the notion of a Distributed Dependence Graph (DDG) as the graphical representation of the relevant dependencies among statements that...

متن کامل

Distributed Partial Order Reduction for Security Protocols

We describe a distributed partial order reduction algorithm for security protocols. Some experimental results using an implementation of the algorithm in the distributed μCRL toolset are also reported.

متن کامل

Opium: An Extendable Trace Analyzer for Prolog

Traces of program executions are a helpful source of information for program debugging. They, however, give a picture of program executions at such a low level that users often have diiculties to interpret the information. Opium, our extendable trace analyzer, is connected to a \standard" Prolog tracer. Opium is programmable and extendable. It provides a trace query language and abstract views ...

متن کامل

Improved Dynamic Partial-Order Reduction for Asynchronous Message-Passing Programs

This paper presents two algorithmic refinements that improve systematic testing of asynchronous message-passing programs for a fixed input. Such programs can have a large number of possible execution paths due to the nondeterministic interleaving of messages. However, many paths are equivalent, and dynamic partial-order reduction (DPOR) techniques attempt to explore all distinct, feasible behav...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2003

ISSN: 1571-0661

DOI: 10.1016/s1571-0661(04)81041-7